Vectorial Boolean Functions for Cryptography
نویسنده
چکیده
To appear as a chapter of the volume " Boolean Methods and Models " ,
منابع مشابه
On the Primary Constructions of Vectorial Boolean Bent Functions∗
Vectorial Boolean bent functions, which possess the maximal nonlinearity and the minimum differential uniformity, contribute to optimum resistance against linear cryptanalysis and differential cryptanalysis for the cryptographic algorithms that adopt them as nonlinear components. This paper is devoted to the new primary constructions of vectorial Boolean bent functions, including four types: ve...
متن کاملNormality of Vectorial Functions
The most important building blocks of symmetric cryptographic primitives such as the DES or the AES, are vectorial Boolean functions, also called S-boxes. In this paper, we extend the definition of normality for Boolean functions into several new affine invariant properties for vectorial Boolean functions. We compute the probability of occurrence of these properties and present practical algori...
متن کاملCharacterizations of o-polynomials by the Walsh transform
Abstract. The notion of o-polynomial comes from finite projective geometry. In 2011 and later, it has been shown that those objects play an important role in symmetric cryptography and coding theory to design bent Boolean functions, bent vectorial Boolean functions, semi-bent functions and to construct good linear codes. In this note, we characterize o-polynomials by the Walsh transform of the ...
متن کاملVectorial Resilient $PC(l)$ of Order $k$ Boolean Functions from AG-Codes
Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see [1], [2], [3], [4], [7], [8], [10], [11] and [16]). Kurosawa , Stoh [8] and Carlet [1] gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper algebraic-geometric codes over GF (2m) are used to modify the Carlet and Kur...
متن کاملA new large class of functions not APN infinitely often
In this paper, we show that there is no vectorial Boolean function of degree 4e, with e satisfaying certain conditions, which is APN over infinitely many extensions of its field of definition. It is a new step in the proof of the conjecture of Aubry, McGuire and Rodier. Vectorial Boolean function and Almost Perfect Non-linear functions and Algebraic surface and CCZ equivalence
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006